Linear splicing and syntactic monoid

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Syntactic Monoid of an Infix Code

Necessary and sufficient conditions on a monoid M are found in order that M be isomorphic to the syntactic monoid of a language L over an alphabet X having one of the following properties. In the first theorem L is a /¿-class and Pw¡¡\ Q PL where PL is the syntactic congruence of L and W(L) is the residue of L . In the second theorem L is an infix code; that is, satisfies u, uvw 6 L implying u ...

متن کامل

On Deterministic Finite Automata and Syntactic Monoid Size, Continued

We continue our investigation on the relationship between regular languages and syntactic monoid size. In this paper we confirm the conjecture on two generator transformation semigroups. We show that for every prime n ≥ 7 there exist natural numbers k and ` with n = k + ` such that the semigroup Uk,` is maximal w.r.t. its size among all (transformation) semigroups which can be generated with tw...

متن کامل

Watson-Crick Bordered Words and their Syntactic Monoid

DNA strands that, mathematically speaking, are finite strings over the alphabet {A, G, C, T} are used in DNA computing to encode information. Due to the fact that A is Watson-Crick complementary to T and G to C, DNA single strands that are Watson-Crick complementary can bind to each other or to themselves in either intended or unintended ways. One of the structures that is usually undesirable f...

متن کامل

On Deterministic Finite Automata and Syntactic Monoid Size

We investigate the relationship between regular languages and syntactic monoid size. In particular, we consider the transformation monoids of n-state (minimal) deterministic finite automata. We show tight upper bounds on the syntactic monoid size, proving that an nstate deterministic finite automaton with singleton input alphabet (input alphabet with at least three letters, respectively) induce...

متن کامل

Linear Armendriz Ring Relative to Monoid

For a monoid M , we introduce linear M-Armendariz rings, which are generalization of M-Armendariz rings and linear Armendariz rings; and investigate their properties. Every reduced ring is linear M-Armendariz, for any unique product monoid. We show that if M be a monoid and R be a right ore ring with classical right quotient ring Q. Then R is linear M-Armendariz if and only if Q is linear M-Arm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Applied Mathematics

سال: 2006

ISSN: 0166-218X

DOI: 10.1016/j.dam.2005.06.008